Enumerating minimum path decompositions to support route choice set generation
نویسندگان
چکیده
منابع مشابه
Evaluation of choice set generation algorithms for route choice models
This paper discusses choice set generation and route choice model estimation for large-scale urban networks. Evaluating the effectiveness of Advanced Traveler Information Systems (ATIS) requires accurate models of how drivers choose routes based on their awareness of the roadway network and their perceptions of travel time. Many of the route choice models presented in the literature pay little ...
متن کاملThe complexity of minimum-length path decompositions
We consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the origi...
متن کاملEnumerating simplicial decompositions of surfaces with boundaries
It is well-known that the triangulations of the disc with n + 2 vertices on its boundary are counted by the nth Catalan number C(n) = 1 n+1 ` 2n
متن کاملMinimum Size Tree-decompositions
We study in this paper the problem of computing a tree-decomposition of a graph with width at most k and minimum number of bags. More precisely, we focus on the following problem: given a fixed k ≥ 1, what is the complexity of computing a treedecomposition of width at most k with minimum number of bags in the class of graphs with treewidth at most k? We prove that the problem is NP-complete for...
متن کاملPath And Cycle Decompositions
First I want to say a few words about my graph terminology. If I want to allow loops, I use the adjective reflexive. If I want to allow multiple edges, I use multigraph. Thus, a graph has no loops and no multiple edges. I use valency rather than degree. If we say a graph is 4-valent (or tetravalent), it means it is regular of valency 4, for example. A decomposition of a graph X is a partition o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2017
ISSN: 1877-0509
DOI: 10.1016/j.procs.2017.05.325